Homotopic l0 minimization technique applied to dynamic cardiac MR imaging
نویسنده
چکیده
Introduction: The l1 minimization technique has been empirically demonstrated to exactly recover an S-sparse signal with about 3S-5S measurements [1]. In order to get exact reconstruction with smaller number of measurements, recently, for static images, Trzasko [2] has proposed homotopic l0 minimization technique. Instead of minimizing the l0 norm which achieves best possible theoretical bound (approximately 2S measurements) but is a NP hard problem or l1 norm which is a convex optimization problem but requires more measurements, the homotopic technique minimizes iteratively the continuous approximations of the l0 norm. In this work, we have extended the use of homotopic l0 method to dynamic MR imaging. For dynamic 2D CINE data, using five different non-convex functional approximations to l0 norm, we have compared the performance of homotopic l0 minimization technique with the standard l1 method. Method: Given a linear system of equations expressed as: Au= b, where u is sparse signal to be recovered, A is a measurement matrix with dimensions MxN (M<<N), b is a set of M measurements; the homotopic l0 minimization problem is solved by iteratively solving a sequence of problems given by b Au s.t. ) σ , (x) u ρ( min arg u t
منابع مشابه
A Hybrid L0-L1 Minimization Algorithm for Compressed Sensing MRI
INTRODUCTION Both L1 minimization [1] and homotopic L0 minimization [2] techniques have shown success in compressed-sensing MRI reconstruction using reduced k-space data. L1 minimization algorithm is known to usually shrink the magnitude of reconstructions especially for larger coefficients [1, 3] and non-convex penalty used in homotopic L0 minimization is advocated to replace L1 penalty [3]. H...
متن کاملA Hybrid L0-L1 Minimization Algorithm for Compressed Sensing MRI
INTRODUCTION Both L1 minimization [1] and homotopic L0 minimization [2] techniques have shown success in compressed-sensing MRI reconstruction using reduced k-space data. L1 minimization algorithm is known to usually shrink the magnitude of reconstructions especially for larger coefficients [1, 3] and non-convex penalty used in homotopic L0 minimization is advocated to replace L1 penalty [3]. H...
متن کاملTRZASKO AND MANDUCA: HIGHLY UNDERSAMPLED MAGNETIC RESONANCE IMAGE RECONSTRUCTION VIA HOMOTOPIC L0-MINIMIZATION 1 Highly Undersampled Magnetic Resonance Image Reconstruction via Homotopic L0-Minimization
In clinical Magnetic Resonance Imaging (MRI), any reduction in scan time offers a number of potential benefits ranging from high-temporal-rate observation of physiological processes to improvements in patient comfort. Following recent developments in Compressive Sensing (CS) theory, several authors have demonstrated that certain classes of MR images which possess sparse representations in some ...
متن کاملQuantitative susceptibility imaging with homotopic L0 minimization programming: preliminary study of brain
INTRODUCTION Susceptibility-weighted imaging (SWI) technique is used for neuroimaging to improve visibility of iron deposits, veins, and hemorrhage [1]. Quantitative susceptibility imaging (QSI) improves upon SWI by measuring iron in tissues, which can be useful for molecular/cellular imaging to analyze brain function, diagnose neurological diseases, and quantify contrast agent concentrations. ...
متن کاملImproved k-t FOCUSS using a sparse Bayesian learning
Introduction: In dynamic MRI, spatio-temporal resolution is a very important issue. Recently, compressed sensing approach has become a highly attracted imaging technique since it enables accelerated acquisition without aliasing artifacts. Our group has proposed an l1-norm based compressed sensing dynamic MRI called k-t FOCUSS which outperforms the existing methods. However, it is known that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009